The current deep learning based instance segmentation methods cannot fully train the network model and result in sub-optimal segmentation results due to the lack of labeled engine blade data. To improve the precision of aeroengine blade instance segmentation， an aeroengine blade instance segmentation method based on incomplete instance guidance was proposed. Combining with an existing instance segmentation method and an interactive segmentation method， promising aeroengine blade instance segmentation results were obtained. First， a small amount of labeled data was used to train the instance segmentation network， which generated initial instance segmentation results of aeroengine blades. Secondly， the detected single blade instance was divided into foreground and background. By selecting foreground seed points and background seed points， the interactive segmentation method was used to generate complete segmentation results of the blade. After all the blade instances were processed in turn， the final segmentation result of engine blade instance was obtained by merging the results. All the 72 images were used to train the Sparse Instance activation map for real-time instance segmentation （SparseInst）， to produce the initial instance segmentation results. The testing dataset contained 56 images. The mean Average Precision （mAP） of the proposed method is higher than that of SparseInst by 5.1 percentage points. The mAP results of the proposed method are better than those of the state-of-the-art instance segmentation methods， e.g.， MASK R-CNN （Mask Region based Convolutional Neural Network）， YOLACT （You Only Look At CoefficienTs）， BMASK-RCNN （Boundary-preserving MASK R-CNN）.

Functional query is an important operation in big data application， and the problem of query answering has always been the core problem in database theory. In order to analyze the complexity of the functional query answering problem on big data， firstly， the functional query language was reduced to a known decidable language by using mapping reduction method， which proves the computability of the functional query answering problem. Secondly， first-order language was used to describe the functional query， and the plexity of the first-order language was analyzed. On this basis， the NC-factor reduction method was used to reduce the functional query class to the known \mathrm{\Pi } {\mathrm{{\rm T}}}_Q -complete class. It is proved that functional query answering problem can be solved in NC time after PTIME （Polynomial TIME） preprocessing. It can be conducted that the functional query answering problem can be handled on big data.

In order to overcome the demerits of poor deeply searching ability and easily relapsing into local extremum in basic Fruit Fly Optimization Algorithm (FOA), a new algorithm named Shuffled Fruit Fly Optimization Algorithm with Local Deep Search (SFOALDS) was proposed. The local optimal individual in each group was deeply searched circularly by referencing updating strategy of Shuffled Frog Leaping Algorithm (SFLA). SFOALDS not only efficiently avoids relapsing into local extremum, but also improves convergence velocity and convergence precision in the late evolution. The experimental results show that the proposed algorithm has better global searching performance than basic FOA and SFLA, especially on high dimensional functions.

To solve the routing confusion of the conventional hierarchical layout algorithm in the large-scale program, based on the Sugiyama hierarchical layout algorithm, this paper proposed an optimized algorithm for channel routing, which dynamically adjusted the number of channel according to the program size. In order to solve the low efficiency and lines overlap, the algorithm built functional relationships between channel number and program size. And by using the generalized tensor balance algorithm to reduce the crossings and realize the artistic layout. The algorithm also gave the corresponding line distribution and application strategy in accordance with the relative positional relationship between the calling nodes to achieve the ordered routing. The experimental results show that the algorithm has greater layout efficiency. It can reduce the crossings effectively, realize clear layout and is easy to implement.